Access and metro network convergence for flexible end-to-end network design

This paper reports on the architectural, protocol, physical layer, and integrated testbed demonstrations carried out by the DISCUS FP7 consortium in the area of access - metro network convergence. Our architecture modeling results show the vast potential for cost and power savings that node consolidation can bring. The architecture, however, also recognizes the limits of long-reach transmission for low-latency 5G services and proposes ways to address such shortcomings in future projects. The testbed results, which have been conducted end-to-end, across access - metro and core, and have targeted all the layers of the network from the application down to the physical layer, show the practical feasibility of the concepts proposed in the project

Water induced sediment levitation enhances downslope transport on Mars

On Mars, locally warm surface temperatures (~293 K) occur, leading to the possibility of (transient) liquid water on the surface. However, water exposed to the martian atmosphere will boil, and the sediment transport capacity of such unstable water is not well understood. Here, we present laboratory studies of a newly recognized transport mechanism: “levitation” of saturated sediment bodies on a cushion of vapor released by boiling. Sediment transport where this mechanism is active is about nine times greater than without this effect, reducing the amount of water required to transport comparable sediment volumes by nearly an order of magnitude. Our calculations show that the effect of levitation could persist up to ~48 times longer under reduced martian gravity. Sediment levitation must therefore be considered when evaluating the formation of recent and present-day martian mass wasting features, as much less water may be required to form such features than previously thought

A packing integer program arising in two-layer network design

In this paper we study a certain cardinality constrained packing integer program which is motivated by the problem of dimensioning a cut in a two-layer network. We prove N P-hardness and consider the facial structure of the corresponding polytope. We provide a complete description for the smallest nontrivial case and develop two general classes of facet-defining inequalities. This approach extends the notion of the well known cutset inequalities to two network layers